Building Consistent Regression Trees From Complex Sample Data

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building mixture trees from binary sequence data

We develop a new method for building a hierarchical tree from binary sequence data. It is based on an ancestral mixture model. The sieve parameter in the model plays the role of time in the evolutionary tree of the sequences. By varying the sieve parameter, one can create a hierarchical tree that estimates the population structure at each fixed backward point in time. Application to the cluster...

متن کامل

Consistent dendrification: Trees from categories

1. lntroduction I shall start by taking a fairly simple Combinatory Categorial Grammar (CCG) of the type developed by Steedrnan over the past decade or so (e.g. Steedman 1996) including rules of functional application, and functional composition. I shall have nothing to say about functional substitution in this paper, and shall assume that there are type-raised categories in the lexicon (e.g. S...

متن کامل

Building Cartesian Trees from Free Trees

One can build a Cartesian tree from an n-element sequence in O(n) time, and from an n-node free tree in O(n log n) time (with a matching worst-case lower bound in the comparison model of computation). We connect these results together by describing an “adaptive” Cartesian tree construction algorithm running in O(n log k) time on a free tree with k leaves. We also provide a matching worst-case l...

متن کامل

Regression Trees from Data Streams with Drift Detection

The problem of extracting meaningful patterns from time changing data streams is of increasing importance for the machine learning and data mining communities. We present an algorithm which is able to learn regression trees from fast and unbounded data streams in the presence of concept drifts. To our best knowledge there is no other algorithm for incremental learning regression trees equipped ...

متن کامل

Building phylogenetic trees from molecular data with MEGA.

Phylogenetic analysis is sometimes regarded as being an intimidating, complex process that requires expertise and years of experience. In fact, it is a fairly straightforward process that can be learned quickly and applied effectively. This Protocol describes the several steps required to produce a phylogenetic tree from molecular data for novices. In the example illustrated here, the program M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2011

ISSN: 0162-1459,1537-274X

DOI: 10.1198/jasa.2011.tm10383